Model for exploiting associative matching in AI production systems
نویسندگان
چکیده
A Content-Addressable Model of Production Systems, `CAMPUS', has been developed. The main idea is to achieve high execution performance in production systems by exploiting the potential fine-grain data parallelism. The facts and the rules of a production system are uniformly represented as CAM tables. CAMPUS differs from other CAM-inspired models in that it is based on a non-state saving and `lazy' matching algorithm. The production system execution cycle is represented by a small number of associative search operations over the CAM tables which number does not depend, or depends slightly, on the number of the rules and the number of the facts in the production system. The model makes efficient implementation of large production systems on fast CAM possible. An experimental CAMPUS realisation of the production language CLIPS is also reported. The production systems execution time for large number of processed facts is about 1,000 times less than the corresponding CLIPS execution time on a standard computer architecture.
منابع مشابه
Frontiers in Run-Time Prediction for the Production-System Paradigm
acceptance of production systems in the industrial world. However, in embedded-control systems, production systems have not been applied intensively because of their nondeterministic run-time behavior. Thus, nonpredictability of response times is a major obstacle to the widespread use of expert systems in the real-time domain. The RETE and TREAT algorithms and their offspring play a major role ...
متن کاملNon-linear Associative-Commutative Many-to-One Pattern Matching with Sequence Variables
Pattern matching is a powerful tool which is part of many functional programming languages as well as computer algebra systems such as Mathematica. Among the existing systems, Mathematica offers the most expressive pattern matching. Unfortunately, no open source alternative has comparable pattern matching capabilities. Notably, these features include support for associative and/or commutative f...
متن کاملMatching Modulo Associativity and Idempotency Is NP-Complete
We show that AI–matching (AI denotes the theory of an associative and idempotent function symbol), which is solving matching word equations in free idempotent semigroups, is NP-complete. Note: this is a full version of the paper [9] and a revision of [8].
متن کاملA Concurrent Architecture for Serializable Production Systems - Parallel and Distributed Systems, IEEE Transactions on
This paper presents a new production system architecture that takes advantage of modern associative memory devices to allow parallel production firing, concurrent matching, and overlap among matching, selection, and firing of productions. We prove that the results produced by the architecture are correct according to the serializability Criterion. A comprehensive event driven simulator is used ...
متن کاملDoes Participation in Farmer Field School Extension Program Improve Crop Yields? Evidence from Smallholder Tea Production Systems in Kenya
Agricultural Extension services are among the most important rural services in developing countries. The services are considered to be a key driver of technological change and productivity growth in agriculture. In Kenya, like in the rest of the developing economies, agricultural extension has largely been delivered through supply–driven approaches. Due to perceived low impact of agricultural e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Knowl.-Based Syst.
دوره 8 شماره
صفحات -
تاریخ انتشار 1995